Search results
14 packages found
Convert a planar graph to a collection of nest polylines
Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph
- planar
- straight
- line
- graph
- geometry
- topology
- polygon
- snap
- rounding
- tjunction
- crossing
- junction
- duplicate
- vertex
- View more
Remove self intersections, t-junctions and duplicate edges/vertices from a planar straight line graph
- planar
- straight
- line
- graph
- geometry
- topology
- polygon
- snap
- rounding
- tjunction
- crossing
- junction
- duplicate
- vertex
- View more
Constrained Delaunay Triangulation in 2D
- constrained
- delaunay
- triangulation
- polygon
- planar
- graph
- vertex
- geometry
- cdt
- 2d
- triangle
- edge
- point
- robust
- View more
Find the faces of a planar graph
Simplifies a planar graph
Computes a boolean combination of two planar graphs
Trims a set of lines based on a planar graph
Trims a set of lines based on a planar graph
Convert a polygon into a planar straight line graph
Draw a planar graph to an svg file
Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis
Given a graph with a graph with a non planar embedding, make changes to this graph so that it becomes planar.
Convert a planar straight line graph into a polygon